A \textsf{C++} reasoner for the description logic $\shdlssx$

We present an ongoing implementation of a KE-tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic DL〈4LQSR,×〉(D) (shortly DL D ). The reasoner checks the consistency of DL D -knowledge bases (KBs) represented in set-theoretic terms. It is implemented in C++ and supports DL D -KBs serialized in the OWL/XML format. To the best of our knowledge, this is the first attempt to implement a reasoner for the consistency checking of a description logic represented via a fragment of set theory that can also classify standard OWL ontologies.